Self-Avoiding chiral Walks
نویسندگان
چکیده
We describe a simple, discrete model of deterministic chiral motion on a square lattice. The model is based on rotating walkers with trailing tails spanning L lattice bonds. These tail segments cannot overlap and their leading A segments cannot be crossed. As prescribed by their chirality, walkers must turn if possible, or go straight, or else correct earlier steps recursively. The resulting motion traces unbound trajectories and complex periodic orbits with various symmetries. Periods tend to decrease with increasing L and vary between L and L. Interacting walkers can form intricate pair states. Some orbits match pinned spiral tip trajectories observed experimentally in excitable systems.
منابع مشابه
Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
We study self-avoiding and neighbour-avoiding walks and lattice trails on two semiregular lattices, the (3.122) lattice and the (4.82) lattice. For the (3.122) lattice we find the exact connective constant for both self-avoiding walks, neighbour-avoiding walks and trails. For the (4.82) lattice we generate long series which permit the accurate estimation of the connective constant for self-avoi...
متن کاملPrudent Self-Avoiding Walks
We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.
متن کاملBallistic behavior for biased self-avoiding walks
For self-avoiding walks on the d-dimensional cubic lattice defined with a positive bias in one of the coordinate directions, it is proved that the drift in the favored direction is strictly positive. c © 2008 Elsevier B.V. All rights reserved. Keyword: Biased self-avoiding walks
متن کاملMulticanonical simulation of the Domb-Joyce model and the Go model: new enumeration methods for self-avoiding walks
We develop statistical enumeration methods for self-avoiding walks using a powerful sampling technique called the multicanonical Monte Carlo method. Using these methods, we estimate the numbers of the two dimensional N-step self-avoiding walks up to N = 256 with statistical errors. The developed methods are based on statistical mechanical models of paths which include self-avoiding walks. The c...
متن کاملThe lace expansion on a tree with application to networks of self-avoiding walks
The lace expansion has been used successfully to study the critical behaviour in high dimensions of self-avoiding walks, lattice trees and lattice animals, and percolation. In each case, the lace expansion has been an expansion along a time interval. In this paper, we introduce the lace expansion on a tree, in which ‘time’ is generalised from an interval to a tree. We develop the expansion in t...
متن کاملSelf-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 20 شماره
صفحات -
تاریخ انتشار 2010